Equivalent literal propagation in the DLL procedure
نویسندگان
چکیده
منابع مشابه
Equivalent literal propagation in the DLL procedure
We propose a simple data structure to represent all equivalent literals such as l1 $ l2 in a CNF formula F , and implement a special look-ahead technique, called equivalency reasoning, to propagate these equivalent literals in F in order to get other equivalent literals and to simplify F . Equivalent literal propagation remedies the ineffectiveness of unit propagation on equivalent literals and...
متن کاملIntegrating symmetry breaking into a DLL procedure
Many real-world problems have interesting symmetries. Encoding these problems into CNF formulas generally results in hard SAT problems. Examples includes the pigeon hole problem, which, although very simple, is nonpolynomial for any resolution-based method when encoded into SAT [6], and the n queen problem. In order to speed up search algorithms for these problems, intrinsic symmetries should b...
متن کاملon the equivalence of constructed-response and multiple-choice : stem-equivalent, stem non-equivalent but content equivalent, and stem and content non-equivalent items in reading comprehension using multifaceted rasch
the present study investigated construct equivalence of multiple choice (mc) and constructed response (cr) item types across stem and content equivalent mc and cr items (item type ‘a’), non-stem-equivalent but content equivalent mc and cr items (item type ‘b’), and non-stem and non-content equivalent mc and cr items (item type ‘c’). one hundred seventy english-major undergraduates completed mc ...
The Role of Literal Meaning in the Comprehension of Non-Literal Constructions
Based on psychological studies which show that metaphors and other non-literal constructions are comprehended in the same amount of time as comparable literal constructions, some researchers have concluded that literal meaning is not computed during comprehension of non-literal constructions. In this paper, we suggest that the empirical evidence does not rule out the possibility that literal me...
متن کاملLiteral-paraconsistent and literal-paracomplete matrices
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00407-9